翻訳と辞書
Words near each other
・ FBI Ten Most Wanted Fugitives by year, 1965
・ FBI Ten Most Wanted Fugitives by year, 1966
・ FBI Ten Most Wanted Fugitives by year, 1967
・ FBI Ten Most Wanted Fugitives by year, 1968
・ FBI Ten Most Wanted Fugitives by year, 1969
・ FBI Ten Most Wanted Fugitives, 1950s
・ FBI Ten Most Wanted Fugitives, 1960s
・ FBI Ten Most Wanted Fugitives, 1970s
・ FBI Ten Most Wanted Fugitives, 1980s
・ FBI Ten Most Wanted Fugitives, 1990s
・ FBI Ten Most Wanted Fugitives, 2000s
・ FBI Ten Most Wanted Fugitives, 2010s
・ FBI transform
・ FBI Victims Identification Project
・ Faà di Bruno
Faà di Bruno's formula
・ Faça Sua História
・ Façade (ballet)
・ Façade (entertainment)
・ Façade (film)
・ Façade (interactive story)
・ Façade discography
・ Façesh
・ Façon Sex
・ Façonnable
・ Faílbe Flann mac Áedo Duib
・ Faît Accompli (Curve song)
・ Faïencerie de Gien
・ Faïz Selemani
・ Faïza Guène


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Faà di Bruno's formula : ウィキペディア英語版
Faà di Bruno's formula

Faà di Bruno's formula is an identity in mathematics generalizing the chain rule to higher derivatives, named after , though he was not the first to state or prove the formula. In 1800, more than 50 years before Faà di Bruno, the French mathematician Louis François Antoine Arbogast stated the formula in a calculus textbook, considered the first published reference on the subject.
Perhaps the most well-known form of Faà di Bruno's formula says that
: f(g(x))=\sum \frac\,\cdots\,m_n!\,n!^}\cdot f^(g(x))\cdot \prod_^n\left(g^(x)\right)^,
where the sum is over all ''n''-tuples of nonnegative integers (''m''1, …, ''m''''n'') satisfying the constraint
:1\cdot m_1+2\cdot m_2+3\cdot m_3+\cdots+n\cdot m_n=n.\,
Sometimes, to give it a memorable pattern, it is written in a way in which the coefficients that have the combinatorial interpretation discussed below are less explicit:
: f(g(x))
=\sum \frac\cdot
f^(g(x))\cdot
\prod_^n\left(\frac\right)^.
Combining the terms with the same value of ''m''1 + ''m''2 + ... + ''m''''n'' = ''k'' and noticing that ''m'' ''j'' has to be zero for ''j'' > ''n'' − ''k'' + 1 leads to a somewhat simpler formula expressed in terms of Bell polynomials ''B''''n'',''k''(''x''1,...,''x''''n''−''k''+1):
: f(g(x)) = \sum_^n f^(g(x))\cdot B_\left(g'(x),g''(x),\dots,g^(x)\right).
== Combinatorial form ==

The formula has a "combinatorial" form:
: f(g(x))=(f\circ g)^(x)=\sum_ f^(g(x))\cdot\prod_g^(x)
where
*π runs through the set Π of all partitions of the set ,
*"''B'' ∈ π" means the variable ''B'' runs through the list of all of the "blocks" of the partition π, and
*|''A''| denotes the cardinality of the set ''A'' (so that |π| is the number of blocks in the partition π and |''B''| is the size of the block ''B'').

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Faà di Bruno's formula」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.